The sandpile group of a thick cycle graph

نویسندگان

چکیده

The majority of graphs whose sandpile groups are known either regular or simple. We give an explicit formula for a family non-regular multi-graphs called thick cycles . A cycle graph is where multi-edges permitted. Its group the direct sum cyclic orders given by quotients greatest common divisors minors its Laplacian matrix. show these can be expressed in terms monomials graph’s edge multiplicities.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the order graph of a group

 The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this  graph. Also we give a relation between the order graph and prime  graph of a group.

متن کامل

On the tenacity of cycle permutation graph

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

متن کامل

Concrete and abstract structure of the sandpile group for thick trees with loops

We answer a question of László Babai concerning the abelian sandpile model. Given a graph, the model yields a finite abelian group of recurrent configurations which is closely related to the combinatorial Laplacian of the graph. We explicitly describe the group elements and operations in the case of thick trees with loops—that is, graphs which are obtained from trees by setting arbitrary edge m...

متن کامل

The sandpile group of a tree

Proof. If the edge (r, s) from the root to the sink is included in the spanning tree, then each of the principal branches of Tn may be assigned an oriented spanning tree independently, so there are t n−1 such spanning trees. On the other hand, if (r, s) is not included in the spanning tree, there is a directed path r → x1 → . . . → xn−1 → s in the spanning tree from the root to the sink. In thi...

متن کامل

On the planarity of a graph related to the join of subgroups of a finite group

‎Let $G$ be a finite group which is not a cyclic $p$-group‎, ‎$p$ a prime number‎. ‎We define an undirected simple graph $Delta(G)$ whose‎ ‎vertices are the proper subgroups of $G$, which are not contained in the‎ ‎Frattini subgroup of $G$ and two vertices $H$ and $K$ are joined by an edge‎ ‎if and only if $G=langle H‎ , ‎Krangle$‎. ‎In this paper we classify finite groups with planar graph‎. ‎...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EJGTA : Electronic Journal of Graph Theory and Applications

سال: 2022

ISSN: ['2338-2287']

DOI: https://doi.org/10.5614/ejgta.2022.10.2.20